Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Fourier analysis and approximation

Harmonic analysis. Fourier analysis --- Approximation theory. --- Fourier analysis. --- Fourier Analysis --- Approximation theory --- Theory of approximation --- Functional analysis --- Functions --- Polynomials --- Chebyshev systems --- Analysis, Fourier --- Mathematical analysis --- Fourier analysis --- 517.44 --- 517.518.8 --- 519.6 --- 681.3*G12 --- 517.518.8 Approximation of functions by polynomials and their generalizations --- Approximation of functions by polynomials and their generalizations --- 681.3*G12 Approximation: chebyshev; elementary function; least squares; linear approximation; minimax approximation and algorithms; nonlinear and rational approximation; spline and piecewise polynomial approximation (Numerical analysis) --- Approximation: chebyshev; elementary function; least squares; linear approximation; minimax approximation and algorithms; nonlinear and rational approximation; spline and piecewise polynomial approximation (Numerical analysis) --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- Computational mathematics. Numerical analysis. Computer programming --- 517.44 Integral transforms. Operational calculus. Laplace transforms. Fourier integral. Fourier transforms. Convolutions --- Integral transforms. Operational calculus. Laplace transforms. Fourier integral. Fourier transforms. Convolutions

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Mallat's book is the undisputed reference in this field - it is the only one that covers the essential material in such breadth and depth. - Laurent Demanet, Stanford UniversityThe new edition of this classic book gives all the major concepts, techniques and applications of sparse representation, reflecting the key role the subject plays in today's signal processing. The book clearly presents the standard representations with Fourier, wavelet and time-frequency transforms, and the construction of orthogonal bases with fast algorithms. The central concept of sparsity is explaine

Harmonic analysis. Fourier analysis --- Mathematical control systems --- Electronics --- Computer science --- Artificial intelligence. Robotics. Simulation. Graphics --- geluidsleer --- digitale signaalverwerking --- beeldverwerking --- Fourieranalyse --- signaalverwerking --- Statistical methods --- Mathematical models --- Data processing --- signals --- Signal processing --- Wavelets (Mathematics) --- Mathematics. --- Mathematics --- 534 --- 534 Vibrations. Acoustics --- Vibrations. Acoustics --- Wavelet analysis --- Harmonic analysis --- Signal processing - Mathematics

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Evolving from an elementary discussion, this book develops the Euclidean algorithm to a very powerful tool to deal with general continued fractions, non-normal Padé tables, look-ahead algorithms for Hankel and Toeplitz matrices, and for Krylov subspace methods. It introduces the basics of fast algorithms for structured problems and shows how they deal with singular situations. Links are made with more applied subjects such as linear system theory and signal processing, and with more advanced topics and recent results such as general bi-orthogonal polynomials, minimal Padé approximation, poly

Ordered algebraic structures --- Numerical approximation theory --- Computer science --- lineaire algebra --- Algebras, Linear --- Euclidean algorithm --- Orthogonal polynomials --- Padé approximant --- #TELE:SISTA --- 519.6 --- 681.3*G11 --- 681.3*G12 --- 681.3*G13 --- Algorithm of Euclid --- Continued division --- Division, Continued --- Euclid algorithm --- Euclidian algorithm --- Euclid's algorithm --- Algorithms --- Number theory --- Linear algebra --- Algebra, Universal --- Generalized spaces --- Mathematical analysis --- Calculus of operations --- Line geometry --- Topology --- 681.3*G13 Numerical linear algebra: conditioning; determinants; Eigenvalues; error analysis; linear systems; matrix inversion; pseudoinverses; sparse and very largesystems --- Numerical linear algebra: conditioning; determinants; Eigenvalues; error analysis; linear systems; matrix inversion; pseudoinverses; sparse and very largesystems --- 681.3*G12 Approximation: chebyshev; elementary function; least squares; linear approximation; minimax approximation and algorithms; nonlinear and rational approximation; spline and piecewise polynomial approximation (Numerical analysis) --- Approximation: chebyshev; elementary function; least squares; linear approximation; minimax approximation and algorithms; nonlinear and rational approximation; spline and piecewise polynomial approximation (Numerical analysis) --- 681.3*G11 Interpolation: difference formulas; extrapolation; smoothing; spline and piecewise polynomial interpolation (Numerical analysis) --- Interpolation: difference formulas; extrapolation; smoothing; spline and piecewise polynomial interpolation (Numerical analysis) --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- Computational mathematics. Numerical analysis. Computer programming --- Fourier analysis --- Functions, Orthogonal --- Polynomials --- Approximant, Padé --- Approximation theory --- Continued fractions --- Power series --- Euclidean algorithm. --- Algebras, Linear. --- Padé approximant. --- Orthogonal polynomials. --- Padé approximant. --- Pade approximant.